Gröbner bases related to 3-dimensional transportation problems
نویسندگان
چکیده
This paper illustrates some work in progress on 3-dimensional transportation problems,of format r×s×t say. Following Conti and Traverso, a suitable Gröbner basis is sought for, which is hard to be calculated by means of Buchberger algorithm. A different approach involving graph theory makes the calculation tractable when r = s = t = 3 (and in fact whenever 3 ∈ {r, s, t}). Introduction The aim of this paper is to illustrate some work in progress on 3-dimensional transportation problems. A typical problem of this kind goes as follows. Given r production facilities F1 . . . Fr, let aik (i := 1 . . . r, k := 1 . . . t) denote the number of units of an indivisible good produced by Fi during the k-th month of a fixed period of t months. Assume that there are s outlets O1 . . . Os each one demanding a certain number of units per month, say bjk (j := 1 . . . s, k := 1 . . . t). If cijk stands for the cost associated with transporting one unit from Fi to Oj during the k-th month, one wishes to minimize the total cost of transportation during the whole period of t months. In mathematical terms, one wishes to solve the integer programming problem associated with the matrix A whose columns are {eij ⊕ e ′ ik ⊕ e ′′ jk | 1 ≤ i ≤ r, 1 ≤ j ≤ s, 1 ≤ k ≤ t}, where {eij} (resp., {e ′ ik} ; resp., {e ′′ jk} ) stands for the canonical basis of the Zmodule of r × s (resp., r × t ; resp., s × t) integer matrices. For 3-dimensional transportation problems see e.g. [Vl] and [St, Chapter 14]. It is well known that integer programming problems as above can be solved by a method first suggested by Conti and Traverso (cf. [CT]), which resorts to the calculation of suitable Gröbner bases (for more information about this method we refer the reader to the survey papers [HT] and [T]). More precisely, if IA denotes the toric ideal canonically associated with the matrix A described before, then one needs to find the reduced Gröbner basis of IA relative to some appropriate term order. 2000 Mathematics Subject Classification. Primary 13P10; Secondary 05C00, 90C10.
منابع مشابه
Quadratic Gröbner bases for smooth 3 × 3 transportation polytopes
The toric ideals of 3 × 3 transportation polytopes Trc are quadratically generated. The only exception is the Birkhoff polytope B3. If Trc is not a multiple of B3, these ideals even have square-free quadratic initial ideals. This class contains all smooth 3 × 3 transportation polytopes.
متن کاملLexicographic Gröbner bases for transportation problems of format r×3×3
By means of suitable sequences of graphs, we describe the reduced lexicographic Gröbner basis of the toric ideal associated with the 3−dimensional transportation problem of format r× 3× 3 (r any integer > 1). In particular, we prove that the bases for r = 2, 3, 4, 5 determine all others.
متن کاملApplications of Gröbner Bases
This paper will provide a brief introduction to Gröbner bases and some of their applications: identifying and proving geometric theorems, solving coloring problems, and computing minimal polynomials.
متن کاملDesigning rotating schedules by using Gröbner bases
In the current paper, we deal with the problem of designing rotating schedules from an algebraic computational approach. Specifically, we determine a set of Boolean polynomials whose zeros can be uniquely identified with the set of rotating schedules related to a given workload matrix and with the different constraints which are usually imposed to them. These polynomials constitute zero-dimensi...
متن کاملElliptic Solitons and the Gröbner Bases
We consider the solution of spectral problems with elliptic potentials in the framework of the Hermite ansatz. We show that the search for potentials and their spectral characteristics is reduced to a system of polynomial equations solvable by the Gröbner bases method and others. New potentials and corresponding solutions of the Sawada–Kotera, Kaup–Kupershmidt, Boussinesq equations are found.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001